Speeding up column generation for robust wireless network planning
نویسندگان
چکیده
منابع مشابه
Speeding up MAP with Column Generation and Block Regularization
In this paper, we show how the connections between max-product message passing and linear programming relaxations for MAP allow for a more efficient exact algorithm than standard dynamic programming. Our proposed algorithm uses column generation to pass messages only on a small subset of the possible assignments to each variable, while guaranteeing to find the exact solution. This algorithm is ...
متن کاملPath Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a dynamic flow problem. If there are several groups with different origins and destinations, then the problem becomes NP-hard. In current games, these problems are solved by using greedy ad hoc rules, leading to long tr...
متن کاملFast motion planning from experience: trajectory prediction for speeding up movement generation
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a new situation, without exploiting similarity to previous problems. In effect, extensive data is accumulated containing situations together with the respective optimized trajectories—but this data is in practice hardly ex...
متن کاملSpeeding up an Algorithm for Checking Robust Stability of Polynomials
The paper considers the robust stability veriication of polynomials with polynomial parameter dependency. A new algorithm is presented which relies on the expansion of a multivariate polynomial into Bernstein polynomials and is based on the inspection of the value set of the family of polynomials on the imaginary axis. It is shown how an initial interval on the imaginary axis through which zero...
متن کاملThe SelMax Planner: Online Learning for Speeding up Optimal Planning∗
The SelMax planner combines two state-of-the-art admissible heuristics using an online learning approach. In this paper we describe the online learning approach employed by SelMax, briefly review the Fast Downward framework, and describe
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2013
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-013-0013-0